Notes on Many-Sorted Logic
نویسنده
چکیده
Preface, p. vii Any reasonable logical system can be naturally translated into many-sorted first-order logic; thus many-sorted first-order logic is a universal logic. Since many-sorted logic can be translated into single-sorted first-order logic the latter is also universal. However, as will be seen in the course of this book, many-sorted logic faithfully interprets the semantics of the object logical language and is, in practical terms, computationally more expressive and efficient. M. Manzano develops case studies in the translation of logics for second-order logic and propositional dynamic logic.
منابع مشابه
Functorial Coalgebraic Logic: The Case of Many-sorted Varieties
Following earlier work, a modal logic for T -coalgebras is a functor L on a suitable variety. Syntax and proof system of the logic are given by presentations of the functor. This paper makes two contributions. First, a previous result characterizing those functors that have presentations is generalized from endofunctors on one-sorted varieties to functors between many-sorted varieties. This yie...
متن کاملTowards Behavioral Maude: Behavioral Membership Equational Logic
How can algebraic and coalgebraic specifications be integrated? How can behavioral equivalence be addressed in an algebraic specification language? The hidden-sorted approach, originating in work of Goguen and Meseguer in the early 80’s, and further developed into the hidden-sorted logic approach by researchers at Oxford, UC San Diego, and Kanazawa offers some attractive answers, and has been i...
متن کاملOrder-sorted Equational Unification Revisited
This paper presents a rule-based algorithm for performing order-sorted E-unification using an unsorted E-unification decision procedure under assumptions about E that are commonly satisfied in practice. We have implemented this algorithm in Maude for use with the Maude-NRL protocol analyzer and have used CiME for unsorted E-unification for E any set of AC and ACU axioms. In many examples of int...
متن کاملUnsorted Functional Translations
In this article we first show how the functional and the optimized functional translation from modal logic to many-sorted first-order logic can be naturally extended to the hybrid language H(@, ↓). The translation is correct not only when reasoning over the class of all models, but for any firstorder definable class. We then show that sorts can be safely removed (i.e., without affecting the sat...
متن کاملSound and Complete Sort Encodings for First-Order Logic
This is a formalization of the soundness and completeness proper-ties for various efficient encodings of sorts in unsorted first-order logicused by Isabelle’s Sledgehammer tool.The results are reported in [1, §2,3] and the formalization itself ispresented in [2, §3–5]. Essentially, the encodings proceed as follows:a many-sorted problem is decorated with (as few as possib...
متن کامل